Spreading Processes and Large Components in Ordered, Directed Random Graphs
نویسندگان
چکیده
Order the vertices of a directed random graph v1, . . . , vn; edge (vi, vj) for i < j exists independently with probability p. This random graph model is related to certain spreading processes on networks. We consider the component reachable from v1 and prove existence of a sharp threshold p∗ = logn/n at which this reachable component transitions from o(n) to Ω(n).
منابع مشابه
Fast Information Spreading in Graphs with a Large Weak Conductance
Gathering data from nodes in a network is at the heart of many distributed applications, most notably, while performing a global task. We consider information spreading among n nodes of a network, where each node v has a message m(v) which must be received by all other nodes. The time required for information spreading has been previously upper-bounded with an inverse relationship to the conduc...
متن کاملCritical line in undirected Kauffman boolean networks - the role of percolation
We show that to correctly describe the position of the critical line in the Kauffman random boolean networks one must take into account percolation phenomena underlying the process of damage spreading. For this reason, since the issue of percolation transition is much simpler in random undirected networks, than in the directed ones, we study the Kauffman model in undirected networks. We derive ...
متن کاملDirected cycles and related structures in random graphs: I- Static properties
We study directed random graphs (random graphs whose edges are directed), and present new results on the so-called strong components of those graphs. We provide analytic and simulation results on two special classes of strong component, called cycle components and knots, which are important in random networks that represent certain computational systems.
متن کاملLimits and colimits in the category of pre-directed complete pre-ordered sets
In this paper, some categorical properties of the category { Pre-Dcpo} of all pre-dcpos; pre-ordered sets which are also pre-directed complete, with pre-continuous maps between them is considered. In particular, we characterize products and coproducts in this category. Furthermore, we show that this category is neither complete nor cocomplete. Also, epimorphisms and monomorphisms in {Pre-Dcpo} ...
متن کاملOptimal network topologies : expanders , cages , Ramanujan graphs , entangled networks and all that
We report on some recent developments in the search for optimal network topologies. First we review some basic concepts on spectral graph theory, including adjacency and Laplacian matrices, paying special attention to the topological implications of having large spectral gaps. We also introduce related concepts such as ‘expanders’, Ramanujan, and Cage graphs. Afterwards, we discuss two differen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1209.2088 شماره
صفحات -
تاریخ انتشار 2012